Route maintenance overheads in DHT overlays
نویسندگان
چکیده
Efficient route maintenance in DHTs is still an area of very active research due to its complexity and multitude of aspects to be considered. In this paper we propose novel correctionon-failure (CoF) and correction-on-use (CoU) approaches that support route maintenance more efficiently than existing methods even under highly dynamical network conditions. In contrast to previous work which addresses static resilience, we apply the more realistic model of viewing changes in the network as a continuous Markovian process and demonstrate that the system can reach a dynamic equilibrium in the presence of continuous changes while remaining operational, efficient, and scalable. We devise a generally applicable method for analyzing the dynamic behavior of route maintenance and use it to proof the efficiency of our approach. The equilibrium equations derived from the analytical model allow us to predict a system’s behavior over a wide range of parameters and demonstrate its scalability. Simulation results additionally verify our analytical results. Our approach also introduces the principle of data independence into route maintenance which we demonstrate to be achievable at low cost. This separation of concern disentangles the overlay from the underlying network dynamics and is an important step towards semantic overlay networks as a basic constituent in distributed information management. It specifically facilitates the application of the P2P paradigm in mobile ad-hoc networks, identity management, tracking of past interactions (e.g., for reputation management), etc. which are of basic importance for overlay supported P2P commerce. Moreover, other domains, for example P2P based publish/subscribe systems, will also benefit from this property of our approach.
منابع مشابه
Implementing Dynamic Querying Search in k-ary DHT-based Overlays
Distributed Hash Tables (DHTs) provide scalable mechanisms for implementing resource discovery services in structured Peer-to-Peer (P2P) networks. However, DHT-based lookups do not support some types of queries which are fundamental in several classes of applications. A way to support arbitrary queries in structured P2P networks is implementing unstructured search techniques on top of DHT-based...
متن کاملByzantine Fault Tolerance of Inverse de Bruijn Overlay Networks for Secure P2P Routing
Byzantine faults in a peer-to-peer (P2P) system are resulted from adversarial and inconsistent peer behaviors. Malicious peers can disrupt the routing functions in peer joining and lookup services. Byzantine attackers may collude with each other to paralyze the entire P2P network operations. We discover a new class of DHT-based overlay networks, called inverse de Bruijn (IDB) graph, to enable m...
متن کاملTourist : A Self - Adaptive Structured Overlay in Heterogeneous P 2 P networks
Structured overlays provide a basic substrate for many peer-to-peer systems. Existing structured overlays can be classified into two categories, O(logN)-hop ones and O(1)-hop ones. The former are suitable for large and dynamic systems, while the latter are suitable for small or stable ones. However, for the lack of adaptivity, it is difficult for a peer-to-peer system designer to choose from th...
متن کاملMinimizing DHT Routing Stretch in MANETs
Since the appearance of Napster in early 1999, peer-to-peer (P2P) networks have experienced tremendous growth. The P2P architectures can be categorized into two main classes: unstructured and structured P2P overlays. Unstructured overlays do not impose a rigid relation between the overlay topology and the indices/resources placement, as flooding or random walks are used to locate resources [3]....
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2003